Extremal graphs with no C4's, C6's, or C10's
نویسندگان
چکیده
منابع مشابه
On Extremal Graphs With No Long Paths
Connected graphs with minimum degree δ and at least 2δ+ 1 vertices have paths with at least 2δ + 1 vertices. We provide a characterization of all such graphs which have no longer paths. Extremal problems involving paths and cycles have been considered since the infancy of graph theory. The question which interests us here is the question of what minimum degree condition guarantees a path of a p...
متن کاملExtremal Graphs Having No Stable Cutsets
A stable cutset in a graph is a stable set whose deletion disconnects the graph. It was conjectured by Caro and proved by Chen and Yu that any graph with n vertices and at most 2n − 4 edges contains a stable cutset. The bound is tight, as we will show that all graphs with n vertices and 2n− 3 edges without stable cutset arise recursively glueing together triangles and triangular prisms along an...
متن کاملExtremal graphs having no matching cuts
A graph G = (V, E) is matching immune if there is no matching cut in G. We show that for any matching immune graph G, |E| ≥ ⌈3(|V | − 1)/2⌉. This bound is tight, as we define operations that construct, from a given vertex, exactly the class of matching immune graphs that attain the bound.
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملGraphs with no induced wheel or antiwheel
A wheel is a graph that consists of a chordless cycle of length at least 4 plus a vertex with at least three neighbors on the cycle. It was shown recently that detecting induced wheels is an NP-complete problem. In contrast, it is shown here that graphs that contain no wheel and no antiwheel have a very simple structure and consequently can be recognized in polynomial time. Four families of gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1991
ISSN: 0095-8956
DOI: 10.1016/0095-8956(91)90097-4